Algorithms for Computing the λ-regularities in Strings
نویسندگان
چکیده
We introduce the notion of λ-regularities in strings that consist of λ-covers and λ-seeds, and study three λ-regularities problems— the λ-cover problem, the general λ-cover problem and the λ-seed problem in this paper. λ-regularities can be viewed as generalized string regularities in the sense that a set of λ repetitive strings rather than a single repeated string are considered. We first present a general algorithm for computing all the λ-combinations of a given string, since they serve as candidates for both λ-covers and λ-seeds. The running time of this algorithm is O(n). Relying on this result, we answer the above mentioned three problems all in O(n) time.
منابع مشابه
Computing regularities in strings: A survey
The aim of this survey is to provide insight into the sequential algorithms that have been proposed to compute exact “regularities” in strings; that is, covers (or quasiperiods), seeds, repetitions, runs (or maximal periodicities), and repeats. After outlining and evaluating the algorithms that have been proposed for their computation, I suggest possibly productive future directions of research.
متن کاملTwo-pattern strings II - frequency of occurrence and substring complexity
The two previous papers in this series introduced a class of infinite binary strings, called two-pattern strings, that constitute a significant generalization of, and include, the much-studied Sturmian strings. The class of two-pattern strings is a union of a sequence of increasing (with respect to inclusion) subclasses TPλ of two-pattern strings of scope λ, λ = 1, 2, · · · . Prefixes of two-pa...
متن کاملThe Generalized Approximate Regularities in Strings
We concentrate on the generalized string regularities and study the minimum approximate λ-cover problem and the minimum approximate λ-seed problem of a string. Given a string x of length n and an integer λ, the minimum approximate λ-cover (resp. seed) problem is to find a set of λ substrings each of equal length that covers x (resp. a superstring of x) with the minimum error, under a variety of...
متن کاملComputing Abelian regularities on RLE strings
Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, . . . , vs of strings such that v1, . . . , vs−1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said t...
متن کاملINTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کامل